Discrete Critical Values: a General Framework for Silhouettes Computation

نویسندگان

  • Frédéric Chazal
  • André Lieutier
  • N. Montana
چکیده

Many shapes resulting from important geometric operations in industrial applications such as Minkowski sums or volume swept by a moving object can be seen as the projection of higher dimensional objects. When such a higher dimensional object is a smooth manifold, the boundary of the projected shape can be computed from the critical points of the projection. In this paper, using the notion of polyhedral chains introduced by Whitney, we introduce a new general framework to define an analogous of the set of critical points of piecewise linear maps defined over discrete objects that can be easily computed. We illustrate our results by showing how they can be used to compute Minkowski sums of polyhedra and volumes swept by moving polyhedra.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accurate Silhouettes - Do Polyhedral Models Suffice?

We investigate whether polyhedral models suffice for accurate silhouette computation. Therefore, we set up a theoretical framework, a mathematical foundation, to compare various algorithms computing silhouettes on spatial and topological accuracy. Within this carefully constructed environment, we can argue on a formal basis why some silhouette-computing algorithms are better than others. In doi...

متن کامل

Supplemental Material for Freeform Shadow Boundary Editing

In this document we present additional results for the paper of Mattausch et al. [MIW13]. In particular, we compare silhouette computation methods used as input for the shadow editing algorithm, show some additional editing and animation examples, and show the effect of the ε parameter of the modified shadow volumes which takes a silhouette vertex so to so. 1 Silhouette Computation A comparison...

متن کامل

Fixed Topology Skeletons

In this paper, we present a novel approach to robust skeleton extraction. We use undirected graphs to model connectivity of the skeleton points. The graph topology remains unchanged throughout the skeleton computation, which greatly reduces sensitivity of the skeleton to noise in the shape outline. Furthermore, this representation naturally defines an ordering of the points along the skeleton. ...

متن کامل

Towards Optimality in Discrete Morse Theory through Chain Homotopies

Once a discrete Morse function has been defined on a finite cell complex, information about its homology can be deduced from its critical elements. The main objective of this paper is to define optimal discrete gradient vector fields on general finite cell complexes, where optimality entails having the least number of critical elements. Our approach is to consider this problem as a homology com...

متن کامل

Towards Knowledge Management: an Exploratory Study for Developing a KM Framework in Iran

This paper is to develop a knowledge management (KM) model in some Iranian academic research centers (ARC) based on KM critical success factors. General KM critical success factors (CSF) were identified through literature review. Then the research procedure led to the identification of KM critical success factors in Iranian ARCs including 16 different factors. It was done through first stage su...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2009